Recursive Algorithms for the Matrix Padé Problem
نویسندگان
چکیده
Abstract. A matrix triangularization interpretation is given for the recursive algorithms computing the Padé approximants along a certain path in the Padé table, which makes it possible to unify all known algorithms in this field [5], [6]. For the normal Padé table, all these results carry over to the matrix Padé problem in a straightforward way. Additional features, resulting from the noncommutativity are investigated. A generalization of the Trench-Zohar algorithm and related recursions are studied in greater detail.
منابع مشابه
Look-ahead Levinson- and Schur-type Recurrences in the Padé Table∗
For computing Padé approximants, we present presumably stable recursive algorithms that follow two adjacent rows of the Padé table and generalize the well-known classical Levinson and Schur recurrences to the case of a nonnormal Padé table. Singular blocks in the table are crossed by look-ahead steps. Ill-conditioned Padé approximants are skipped also. If the size of these lookahead steps is bo...
متن کاملFraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
We present a new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors. Examples of these interpolants include Padé approximants, Newton–Padé, Hermite–Padé, and simultaneous Padé approximants, and more generally M-Padé approximants along with their matrix generalizations. The algorithms are fast and compute all solutions to a given probl...
متن کاملMultivariate Frobenius–Padé approximants: Properties and algorithms
The aim of this paper is to construct rational approximants for multivariate functions given by their expansion in an orthogonal polynomial system. This will be done by generalizing the concept of multivariate Padé approximation.After defining themultivariate Frobenius–Padé approximants, we will be interested in the two following problems: the first one is to develop recursive algorithms for th...
متن کاملComputing minimal interpolation bases
We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Padé approximation problem in [Van Barel and Bultheel, Numerical Algorithms 3, 1992] and the rational interpolation problem in [Beckermann and Labahn, SIAM J. Matrix Anal. Appl. 22, 2000]. Particular inst...
متن کاملAn Improved Schur-Padé Algorithm for Fractional Powers of a Matrix and Their Fréchet Derivatives
The Schur–Padé algorithm [N. J. Higham and L. Lin, SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1056–1078] computes arbitrary real powers At of a matrix A ∈ Cn×n using the building blocks of Schur decomposition, matrix square roots, and Padé approximants. We improve the algorithm by basing the underlying error analysis on the quantities ‖(I − A)k‖1/k , for several small k, instead of ‖I−A‖. We ex...
متن کامل